A determinant formula for the Jones polynomial of pretzel knots

This paper presents an algorithm to construct a weighted adjacency matrix of a plane bipartite graph obtained from a pretzel knot diagram. The determinant of this matrix after evaluation is shown to be the Jones polynomial of the pretzel knot by way of perfect matchings (or dimers) of this graph. The weights are Tutte's activity letters that arise because the Jones polynomial is a specialization of the signed version of the Tutte polynomial. The relationship is formalized between the familiar spanning tree setting for the Tait graph and the perfect matchings of the plane bipartite graph above. Evaluations of these activity words are related to the chain complex for the Champanerkar-Kofman spanning tree model of reduced Khovanov homology.Comment: 19 pages, 12 figures, 2 table

Synthesis of distributed systems Annual report, 1 Sep. 1967 - 31 Aug. 1968

Synthesis of distributed systems with application to feedback networks for phase shift oscillator

Optimal Iris Fuzzy Sketches

Fuzzy sketches, introduced as a link between biometry and cryptography, are a way of handling biometric data matching as an error correction issue. We focus here on iris biometrics and look for the best error-correcting code in that respect. We show that two-dimensional iterative min-sum decoding leads to results near the theoretical limits. In particular, we experiment our techniques on the Iris Challenge Evaluation (ICE) database and validate our findings.Comment: 9 pages. Submitted to the IEEE Conference on Biometrics: Theory, Applications and Systems, 2007 Washington D

Synthesis of distributed systems Final report, 1 Sep. 1966 - 31 Aug. 1969

Algorithm for synthesis of distributed systems to solve circuit design problem

RFID Key Establishment Against Active Adversaries

We present a method to strengthen a very low cost solution for key agreement with a RFID device. Starting from a work which exploits the inherent noise on the communication link to establish a key by public discussion, we show how to protect this agreement against active adversaries. For that purpose, we unravel integrity $(I)$-codes suggested by Cagalj et al. No preliminary key distribution is required.Comment: This work was presented at the First IEEE Workshop on Information Forensics and Security (WIFS'09) (update including minor remarks and references to match the presented version

Charge Transfer in Partition Theory

The recently proposed Partition Theory (PT) [J.Phys.Chem.A 111, 2229 (2007)] is illustrated on a simple one-dimensional model of a heteronuclear diatomic molecule. It is shown that a sharp definition for the charge of molecular fragments emerges from PT, and that the ensuing population analysis can be used to study how charge redistributes during dissociation and the implications of that redistribution for the dipole moment. Interpreting small differences between the isolated parts' ionization potentials as due to environmental inhomogeneities, we gain insight into how electron localization takes place in H2+ as the molecule dissociates. Furthermore, by studying the preservation of the shapes of the parts as different parameters of the model are varied, we address the issue of transferability of the parts. We find good transferability within the chemically meaningful parameter regime, raising hopes that PT will prove useful in chemical applications.Comment: 12 pages, 16 figure

Lyapunov Exponents from Kinetic Theory for a Dilute, Field-driven Lorentz Gas

Positive and negative Lyapunov exponents for a dilute, random, two-dimensional Lorentz gas in an applied field, $\vec{E}$, in a steady state at constant energy are computed to order $E^{2}$. The results are: $\lambda_{\pm}=\lambda_{\pm}^{0}-a_{\pm}(qE/mv)^{2}t_{0}$ where $\lambda_{\pm}^{0}$ are the exponents for the field-free Lorentz gas, $a_{+}=11/48, a_{-}=7/48$, $t_{0}$ is the mean free time between collisions, $q$ is the charge, $m$ the mass and $v$ is the speed of the particle. The calculation is based on an extended Boltzmann equation in which a radius of curvature, characterizing the separation of two nearby trajectories, is one of the variables in the distribution function. The analytical results are in excellent agreement with computer simulations. These simulations provide additional evidence for logarithmic terms in the density expansion of the diffusion coefficient.Comment: 7 pages, revtex, 3 postscript figure

Effects of noise upon human information processing

Studies of noise effects upon human information processing are described which investigated whether or not effects of noise upon performance are dependent upon specific characteristics of noise stimulation and their interaction with task conditions. The difficulty of predicting noise effects was emphasized. Arousal theory was considered to have explanatory value in interpreting the findings of all the studies. Performance under noise was found to involve a psychophysiological cost, measured by vasoconstriction response, with the degree of response cost being related to scores on a noise annoyance sensitivity scale. Noise sensitive subjects showed a greater autonomic response under noise stimulation

An Extension of the Fluctuation Theorem

Heat fluctuations are studied in a dissipative system with both mechanical and stochastic components for a simple model: a Brownian particle dragged through water by a moving potential. An extended stationary state fluctuation theorem is derived. For infinite time, this reduces to the conventional fluctuation theorem only for small fluctuations; for large fluctuations, it gives a much larger ratio of the probabilities of the particle to absorb rather than supply heat. This persists for finite times and should be observable in experiments similar to a recent one of Wang et al.Comment: 12 pages, 1 eps figure in color (though intelligible in black and white

Optimization of Network Robustness to Waves of Targeted and Random Attack

We study the robustness of complex networks to multiple waves of simultaneous (i) targeted attacks in which the highest degree nodes are removed and (ii) random attacks (or failures) in which fractions $p_t$ and $p_r$ respectively of the nodes are removed until the network collapses. We find that the network design which optimizes network robustness has a bimodal degree distribution, with a fraction $r$ of the nodes having degree k_2= (\kav - 1 +r)/r and the remainder of the nodes having degree $k_1=1$, where \kav is the average degree of all the nodes. We find that the optimal value of $r$ is of the order of $p_t/p_r$ for $p_t/p_r\ll 1$